Incomplete and noisy network data as a percolation process
نویسندگان
چکیده
منابع مشابه
Incomplete and noisy network data as a percolation process.
We discuss the ramifications of noisy and incomplete observations of network data on the existence of a giant connected component (GCC). The existence of a GCC in a random graph can be described in terms of a percolation process, and building on general results for classes of random graphs with specified degree distributions we derive percolation thresholds above which GCCs exist. We show that ...
متن کاملHyperspectral Unmixing from Incomplete and Noisy Data
In hyperspectral images, once the pure spectra of the materials are known, hyperspectral unmixing seeks to find their relative abundances throughout the scene. We present a novel variational model for hyperspectral unmixing from incomplete noisy data, which combines a spatial regularity prior with the knowledge of the pure spectra. The material abundances are found by minimizing the resulting c...
متن کاملA Method for Retrieving Images from Noisy Incomplete Data
We propose here a nev method for retrieving an image from noisy, incomplete data. It is based on an idea incorporating the principle of maximum entropy, a veil known powerful method for image processing. An image is built on the computer by allocating grains to pixels one at a time on the basis of certain deterministic rules as to where each successive grain is placed in image space. The perfor...
متن کاملUnsupervised record matching with noisy and incomplete data
We consider the problem of duplicate detection: given a large data set in which each entry has multiple attributes, detect which distinct entries refer to the same real world entity. Our method consists of three main steps: creating a similarity score between entries, grouping entries together into ‘unique entities’, and refining the groups. We compare various methods for creating similarity sc...
متن کاملPSOM+: Parametrized Self-Organizing Maps for noisy and incomplete data
We present an extension to the Parametrized Self-Organizing Map that allows the construction of continuous manifolds from noisy, incomplete and not necessarily gridorganized training data. All three problems are tackled by minimizing the overall smoothness of a PSOM manifold. For this, we introduce a matrix which defines a metric in the space of PSOM weights, depending only on the underlying gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of The Royal Society Interface
سال: 2010
ISSN: 1742-5689,1742-5662
DOI: 10.1098/rsif.2010.0044